منابع مشابه
Approximate Dynamic Programming via Linear Programming
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...
متن کاملIndex coding via linear programming
Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and efficient communication in wireless networks and in part by its connection to Network Coding. Optimal encoding schemes and efficient heuristics were studied in various settings, alongside leading to new results for Network Coding such as improved gaps between linear and n...
متن کاملHarsanyi’s utilitarianism via linear programming
A simple linear programming problem permits a brief and elementary proof of Harsanyi’s utilitarianism theorem: a Paretian social welfare function must be a weighted (affine) sum of individual utility functions when individual utilities and social welfare all take the Neumann–Morgenstern form. By adjusting the programming problem slightly, we conclude that the weights on individual utilities are...
متن کاملSecretary Problems via Linear Programming
In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. This basic concept of n elements arriving in a random order and irrevocable decisions made by an algorithm have been explored extensively over the years, and used for modeling the behavior of many processes. Our main contribution is a new linear prog...
متن کاملDiscriminative training via linear programming
This paper presents a linear programming approach to discriminative training. We first define a measure of discrimination of an arbitrary conditional probability model on a set of labeled training data. We consider maximizing discrimination on a parametric family of exponential models that arises naturally in the maximum entropy framework. We show that this optimization problem is globally conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2014
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-014-9888-2